Technology Performance Pulse

Search:

DAY

WEEK

MONTH

YEAR

Select your country:
Sign up | Log in

SMT solvers

TLA+ model checking made symbolic

The Morning Paper

NOVEMBER 28, 2019

This paper introduces an alternative symbolic model checker for TLA+ called APALACHE: Unlike TLC, APALACHE translates the underlying transition relation into quantifier-free SMT constraints, which allows us to exploit the power of SMT solvers. The implementation uses the Z3 SMT solver.

Tuning

Tuning Benchmarking Efficiency Systems

Scaling symbolic evaluation for automated verification of systems code with Serval

The Morning Paper

NOVEMBER 12, 2019

Given the problem of verifying a finite implementation against its specification, a domain-specific automated verifier reduces this problem to a satisfiability query using symbolic evaluation and discharges the query with a solver such as Z3. If verification fails (e.g.,

Code

Code Systems Programming Google

TLA+ model checking made symbolic

Scaling symbolic evaluation for automated verification of systems code with Serval

Stay Connected